A New Class of Optimal Variable-Weight Optical Orthogonal Codes
نویسندگان
چکیده
Optical orthogonal codes (OOCs) are widely used as spreading codes in optical fiber networks. They are classified into constant-weight OOCs (CW-OOCs) and variable-weight OOCs (VW-OOCs). While CW-OOCs support a single quality of service (QoS), VW-OOCs may support multiple QoSs according to the weights of their codewords. In this paper, we present a new class of VW-OOCs of length (q − 1)p by extending a known CW-OOC of length p, where p is an odd prime and q is a prime power such that p = (q− 1)(q− 2)L+1 for a positive integer L. They are optimal with respect to the Yang bound. Moreover, they may have arbitrarily large weight whereas the recently reported VW-OOCs have only some small weights.
منابع مشابه
Geometric constructions of optimal optical orthogonal codes
We provide a variety of constructions of (n,w, λ)-optical orthogonal codes using special sets of points and Singer groups in finite projective spaces. In several of the constructions, we are able to prove that the resulting codes are optimal with respect to the Johnson bound. The optimal codes exhibited have λ = 1, 2 and w − 1 (where w is the weight of each codeword in the code). The remaining ...
متن کاملOptical orthogonal codes: Their bounds and new optimal constructions
A (v, k, λa, λc) optical orthogonal code C is a family of (0, 1)-sequences of length v and weight k satisfying the following two correlation properties: (1) ∑ 0≤t≤v−1xtxt+i ≤ λa for any x = (x0, x1, . . . , xv−1) and any integer i 6≡ 0 mod v; and (2) ∑ 0≤t≤v−1xtyt+i ≤ λb for any x = (x0, x1, . . . , xv−1), y = (y0, y1, . . . , yv−1) with x 6= y, and any integer i, where subscripts are taken mod...
متن کاملPerfect difference families and related variable-weight optical orthogonal codes
Perfect (v,K, 1) difference families ((v,K, 1)-PDF in short, and (v, k, 1)-PDF when K = {k}) were introduced by Ge et al. for their useful application to the construction of properly centered permutations, which can be used to construct new radar arrays. Some works had been done on the existences of (v, k, 1)-PDFs, while little is known when |K| ≥ 2 except for partial results by Ge et al. In 19...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کامل2-dimensional Optical Orthogonal Codes from Singer Groups
We present several new families of (Λ × T,w, λ) (2-D) wavelength/time optical orthogonal codes (2D-OOCs) with λ = 1, 2. All families presented are either optimal with respect to the Johnson bound (J-optimal) or are asymptotically optimal. The codes presented have more flexible dimensions and weight than the J-optimal families appearing in the literature. The constructions are based on certain p...
متن کامل